#include <iostream>

int const maxn = 50;
int f[maxn][maxn];
int sum[maxn][maxn];
long long n, m;

int main()
{
	int n = 10;
	sum[0][0] = 1;
	for (int i = 0; i <= n; i++) sum[i][0] = sum[0][i] = 1;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++) {
			f[i][j] = sum[i - 1][j - 1];
			sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + f[i][j];
		}
	for (int i = 1; i <= 10; i++) {
		for (int j = 1; j <= 10; j++) {
			std::cout << f[i][j] << ' ';
		}
		std::cout << '\n';
	}
}

